Self-modifying Finite Automata | Power and Limitations Self-modifying Finite Automata | Power and Limitations
نویسنده
چکیده
The Self-Modifying Finite Automaton (SMFA) is a model of computation introduced in [RS93, RS94, RS95b]. Formal de nitions appear in [RS95a]. This paper further investigates the computational power of the model, and introduces the concepts of path determinism and register complexity.
منابع مشابه
Self-Modifying Finite Automata
We present here a new model of computation: the Self-Modifying Finite Automaton (SMFA). This is similar to a standard nite automaton, but changes to the machine are allowed during a computation. It is shown here that a weak form of this model has the power to recognize an important class of context-free languages, the metalinear languages, as well as some signi cant non-context-free languages. ...
متن کاملSelf-modifying Finite Automata | Basic Deenitions and Results Self-modifying Finite Automata | Basic Deenitions and Results
We formally de ne the Self-Modifying Finite Automaton (SMFA), a model of computation introduced in [RS93, RS94, RS95], as a subclass of a new more general model, the Self-Modifying Automaton (SMA). SMAs are similar to standard nite automata, but changes to the transition set are allowed during a computation. An SMFA is constrained in that it can have only nitely many di erent modi cation instru...
متن کاملSelf-Modifying Finite Automata - Basic Definitions and Results
We formally de ne the Self-Modifying Finite Automaton (SMFA), a model of computation introduced in [RS93, RS94, RS95], as a subclass of a new more general model, the Self-Modifying Automaton (SMA). SMAs are similar to standard nite automata, but changes to the transition set are allowed during a computation. An SMFA is constrained in that it can have only nitely many di erent modi cation instru...
متن کاملNEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کاملUsing Adaptive Automata in a Multi-paradigm Programming Environment
In this paper the architecture of an experimental multiparadigmatic programming environment is sketched, showing how its parts combine together with application modules in order to perform the integration of program modules written in different programming languages and paradigms. Adaptive automata are special self-modifying formal state machines used as a design and implementation tool in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995